Polynomials and limited sets
نویسندگان
چکیده
منابع مشابه
Almost vanishing polynomials for sets of limited precision points
From the numerical point of view, given a set X ⊂ Rn of s points whose coordinates are known with only limited precision, each set e X of s points whose elements differ from those of X of a quantity less than the data uncertainty can be considered equivalent to X. We present an algorithm that, given X and a tolerance ε on the data error, computes a set G of polynomials such that each element of...
متن کاملStable sets and polynomials
Several applications of methods from non-linear algebra to the stable set problem in graphs are surveyed. The most recent work sketched is joint with A. Schrijver and involves non-linear inequalities. These yield a procedure to generate facets of the stable set polytope. If a class of graphs has the property that all facets of the stable set polytope can be generated this way in a bounded numbe...
متن کاملZero sets of univariate polynomials
Let L be the zero set of a nonconstant monic polynomial with complex coe¢ cients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion of distance from a point to a subset, more general than the usual one, that allows us to measure distances to subsets like L. To verify the correctness of th...
متن کاملLagrange polynomials of lower sets
A lower set of nodes is a subset of a grid that can be indexed by a lower set of indices. In order to apply the Lagrange interpolation formula, it is convenient to express the Lagrange fundamental polynomials as sums of few terms. We present such a formula for the Lagrange interpolation formula in two variables. In the general multidimensional case, we express the Lagrange fundamental polynomia...
متن کاملMinimizing Polynomials Over Semialgebraic Sets
This paper concerns a method for finding the minimum of a polynomial on a semialgebraic set, i.e., a set in R defined by finitely many polynomial equations and inequalities, using the Karush-Kuhn-Tucker (KKT) system and sum of squares (SOS) relaxations. This generalizes results in the recent paper [15], which considers minimizing polynomials on algebraic sets, i.e., sets in R defined by finitel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1996
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-96-03175-9